Step of Proof: int_lower_wf
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
int
lower
wf
:
i
:
. {...
i
}
Type
latex
by ((Unfold `int_lower` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat
C
3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
{...
i
}
,
t
T
,
x
:
A
.
B
(
x
)
,
Lemmas
le
wf
origin